package com.some;

import java.util.Scanner;

public class GcdAndLcm {
    // 最大公约数
    public int gcd(int m, int n) {
        if (n > m) {
            return gcd(n, m);
        }
        int tmp;
        while (m % n != 0) {
            tmp = m % n;
            m = n;
            n = tmp;
        }
        return n;
    }

    // 最小公倍数
    public int lcm(int m, int n) {
        return m * n / gcd(m, n);
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        GcdAndLcm gcdAndLcm = new GcdAndLcm();
        int a = sc.nextInt();
        int b = sc.nextInt();
        int lcm = gcdAndLcm.lcm(a, b);
        System.out.println(lcm);
    }
}
